Complexity-Restricted Advice Functions
نویسندگان
چکیده
We consider uniform subclasses of the nonuniform complexity classes de ned by Karp and Lipton via the notion of advice functions These subclasses are obtained by restricting the complexity of computing correct advice We also investigate the e ect of allowing advice functions of limited complexity to depend on the input rather than on the input s length Among other results using the notions described above we give new characterizations of a NP SPARSE b NP with a restricted access to an NP oracle and c the odd levels of the boolean hierarchy As a consequence we show that every set that is nondeterministically truth table reducible to SAT in the sense of Rich is already deterministically truth table reducible to SAT Furthermore it turns out that the NP reduction classes of bounded versions of this reducibility coincide with the odd levels of the boolean hierarchy
منابع مشابه
A little advice can be very helpful
Proving superpolylogarithmic lower bounds for dynamic data structures has remained an open problem despite years of research. Recently, Pǎtraşcu proposed an exciting new approach for breaking this barrier via a two player communication model in which one player gets private advice at the beginning of the protocol. He gave reductions from the problem of solving an asymmetric version of set-disjo...
متن کاملOn the Power of Laconic Advice in Communication Complexity
We continue the study of a recently introduced model of communication complexity with advice, focusing on the power of advice in the context of equality of bitstrings and divisibility of natural numbers. First, we establish that the equality problem admits a protocol of polylogarithmic communication, provided a laconic advice of just one bit. For the divisibility problem, we design a protocol w...
متن کاملReal Benefit of Promises and Advice
Promises are a standard way to formalize partial algorithms; and advice quantifies nonuniformity. For decision problems, the latter is captured in common complexity classes such as P/ poly, that is, with advice growing in size with that of the input. We advertise constant-size advice and explore its theoretical impact on the complexity of classification problems – a natural generalization of pr...
متن کاملAdvice for Semifeasible Sets and the Complexity-Theoretic Cost(lessness) of Algebraic Properties
This paper provides a tutorial overview of the advice complexity of the semifeasible sets—informally put, the class of sets having a polynomial-time algorithm that, given as input any two strings of which at least one belongs to the set, will choose one that does belong to the set. No previous familiarity with either the semifeasible sets or advice complexity will assumed, and when we include p...
متن کاملLNCS 7921 - The Nature of Computation
Promises are a standard way to formalize partial algorithms; and advice quantifies nonuniformity. For decision problems, the latter is captured in common complexity classes such as P/poly, that is, with advice growing in size with that of the input. We advertise constant-size advice and explore its theoretical impact on the complexity of classification problems – a natural generalization of pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Comput.
دوره 23 شماره
صفحات -
تاریخ انتشار 1994